A Framework of Directionality for Proving Termination of Logic Programs
نویسندگان
چکیده
In this paper we propose a rich notion of directionality of predicates that combines modes and regular tree types. We provide a semantic soundness result for this notion and give inference systems to decide well-modedness of logic programs and goals. We show how this rich notion of directionality can be used to prove the universal termination of LD-resolution for logic programs with non-ground goals by using simple syntactic orderings of the kind used in rewriting theory.
منابع مشابه
A Typed Foundation for Directional Logic Programming
A long standing problem in logic programming is how to impose directionality on programs in a safe fashion. The benefits of directionality include freedom from explicit sequential control, the ability to reason about algorithmic properties of programs (such as termination, complexity and deadlock-freedom) and controlling concurrency. By using Girard’s linear logic, we are able to devise a type ...
متن کاملA Resource-Based Logic for Termination and Non-Termination Proofs (Technical Report)
We propose a unified logical framework for specifying and proving both termination and non-termination of various programs. Our framework is based on a resource logic which captures both upper and lower bounds on resources used by the programs. By an abstraction, we evolve this resource logic for execution length into a temporal logic with three predicates to reason about termination, non-termi...
متن کاملA Resource-Based Logic for Termination and Non-termination Proofs
We propose a unified logical framework for specifying and proving both termination and non-termination of various programs. Our framework is based on a resource logic which captures both upper and lower bounds on resources used by the programs. By an abstraction, we evolve this resource logic for execution length into a temporal logic with three predicates to reason about termination, non-termi...
متن کاملAutomated termination analysis for logic programs with cut
Termination is an important and well-studied property for logic programs. However, almost all approaches for automated termination analysis focus on definite logic programs, whereas real-world Prolog programs typically use the cut operator. We introduce a novel pre-processing method which automatically transforms Prolog programs into logic programs without cuts, where termination of the cut-fre...
متن کاملInductive Fixpoints in Higher Order Logic
We show that an analogue of the domain-theoretic least fixpoint operator can be defined in a purely set-theoretic framework. It can be formalized in classical higher order logic, serving as a solid foundation for proving termination of (possibly nested) recursive programs in a variety of mechanized proof systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992